Fourier spectra of measures associated with algorithmically random Brownian motion

نویسندگان

  • Willem L. Fouché
  • Safari Mukeru
  • George Davie
چکیده

Abstract. In this paper we study the behaviour at infinity of the Fourier transform of Radon measures supported by the images of fractal sets under an algorithmically random Brownian motion. We show that, under some computability conditions on these sets, the Fourier transform of the associated measures have, relative to the Hausdorff dimensions of these sets, optimal asymptotic decay at infinity. The argument relies heavily on a direct characterisation, due to Asarin and Pokrovskii, of algorithmically random Brownian motion in terms of the prefix-free Kolmogorov complexity of finite binary sequences. The study also necessitates a closer look at the potential theory over fractals from a computable point of view.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diophantine properties of brownian motion: recursive aspects

We use recent results on the Fourier analysis of the zero sets of Brownian motion to explore the diophantine properties of an algorithmically random Brownian motion ( also known as a complex oscillation). We discuss the construction and definability of perfect sets which are linearly independent over the rationals directly from Martin-Löf random reals. Finally we explore the recent work of Tsir...

متن کامل

The rapid points of a complex oscillation

By considering a counting-type argument on Brownian sample paths, we prove a result similar to that of Orey and Taylor on the exact Hausdorff dimension of the rapid points of Brownian motion. Because of the nature of the proof we can then apply the concepts to so-called complex oscillations (or algorithmically random Brownian motion), showing that their rapid points have the same dimension.

متن کامل

The Fourier-mehler Transform and Generalized Dilations of Gaussian and Poisson Measures

We deene a family of random dilations of the Wiener and Poisson measures, and show that they can be represented as generalised Fourier-Mehler transforms. These (not quasi invariant) transformations include transforms given e.g. by time changes on Brownian motion. The generators of one-parameter families of such transformations are computed, and the Poisson case is also considered.

متن کامل

The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion

Algorithmic randomness is most often studied in the setting of the fair-coin measure on the Cantor space, or equivalently Lebesgue measure on the unit interval. It has also been considered for the Wiener measure on the space of continuous functions. Answering a question of Fouché, we show that Khintchine’s law of the iterated logarithm holds at almost all points for each Martin-Löf random path ...

متن کامل

On zeros of Martin-Löf random Brownian motion

We investigate the sample path properties of Martin-Löf random Brownian motion. We show (1) that many classical results which are known to hold almost surely hold for every Martin-Löf random Brownian path, (2) that the effective dimension of zeroes of a Martin-Löf random Brownian path must be at least 1/2, and conversely that every real with effective dimension greater than 1/2 must be a zero o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Logical Methods in Computer Science

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2014